Routing In Cellular Sensornets With Uniquely Identified Destination Nodes
نویسندگان
چکیده
Sensornet nodes observe physical phenomena, yielding data labelled with their geographic position. Geographic context can be exploited in packet routing to minimise energy consumption, provided that the application does not need to route packets to uniquely identified nodes. The latter may be necessary for a minority of packets concerning system management and sensor tasking. We present a hybrid approach to packet routing for cellular sensornets. A geography-aware mechanism routes packets between cells, which is sufficient for the majority of packets. For the minority of packets which must be delivered to uniquely identified nodes, a geography-ignorant mechanism handles the final stages of packet delivery within the cell containing the destination node.
منابع مشابه
Beacon Vector Routing: Scalable Point-to-Point in Wireless Sensornets
This paper proposes a practical and scalable technique for point-to-point routing in wireless sensornets. This method, called Beacon Vector Routing (BVR), assigns coordinates to nodes based on the vector of distances (hop count) to a small set of beacons, and then defines a distance metric on these coordinates. Packets are routed greedily, being forwarded to the next hop that is the closest (ac...
متن کاملMultipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...
متن کاملEfficient Use of Route Requests for Loop-Free On-demand Routing in Ad Hoc Networks
We present a new loop-free on-demand routing protocol for ad-hoc networks, the Labeled Successor Routing (LSR) protocol, which identifies loop-free successors to a destination using route-request labels (RRL). Each route request (RREQ) used during the on-demand destination search process is identified uniquely by a sequence number associated with the issuing source address. Route replies (RREP)...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملA fault tolerance routing protocol considering defined reliability and energy consumption in wireless sensor networks
In wireless sensor networks, optimal consumptionof energy and having maximum life time are important factors. In this article attempt has been made to send the data packets with particular reliability from the beginning based on AODV protocol. In this way two new fields add to the routing packets and during routing and discovering of new routes, the lowest remained energy of nodes and route tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010